Axiom Pinpointing in General Tableaux

نویسندگان

  • Franz Baader
  • Rafael Peñaloza
چکیده

Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL. The purpose of this paper is to develop a general approach for extending a tableau-based algorithm to a pinpointing algorithm. This approach is based on a general definition of “tableaux algorithms,” which captures many of the known tableau-based algorithms employed in DLs, but also other kinds of reasoning procedures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Tableaux and Automata for Pinpointing in EL

Axiom-pinpointing refers to the task of understanding the specific axioms that cause a consequence to follow from an ontology. The main problems related to axiom-pinpointing are the computation of minimal subontologies from which the consequence still follows (MinAs) or maximal subontologies not satisfying a property (MaNAs). Equivalently, one can try to compute a pinpointing formula, which is ...

متن کامل

Wie findet man die verantwortlichen Axiome? Axiom-Pinpointing in Beschreibungslogiken

Axiom-Pinpointing bestimmt die für eine Konsequenz verantwortlichen Axiome einer Ontologie und unterstützt dadurch die Suche und Behebung von Fehlern. In der Arbeit [Peñ09b], deren Resultate hier zusammengefasst werden, wurde untersucht, unter welchen Bedingungen sich tableau-artige und auf automaten-basierte Schlußfolgerungsverfahren für Beschreibungslogiken stets zu Pinpointing-Verfahren erwe...

متن کامل

Complexity of Axiom Pinpointing in the DL-Lite Family

In real world applications where ontologies are employed, often the knowledge engineer not only wants to know whether her ontology has a certain (unwanted) consequence or not, but also wants to know why it has this consequence. Even for ontologies of moderate size, finding explanations for a given consequence is not an easy task without getting support from an automated tool. The task of findin...

متن کامل

Non-standard Inference for Explaining Subsumption in the Description Logic El with General Concept Inclusions and Complex Role Inclusions

Ontologies [11] are now ubiquitous and many of them are currently being ported into logical formalisms, most notably description logic (DL) [2]. It is inevitable that such migration might introduces inconsistencies – both in terms of logically and ontologically – which could be far from obvious. This motivates the recent research topic of explanation of DLbased ontologies. Explanation comes in ...

متن کامل

Analysis of Pinpointing Algorithms for the Description Logic ALC

Most commonly used Description Logic reasoning systems provide only limited support for debugging logically inconsistent knowledge bases. Attempts have been made to come up with algorithms that solve the debugging problem by suggesting possible resolutions. These algorithms use the method of pinpointing of the axioms in the knowledge bases that are the possible source of inconsistency. In this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2007